Inverse semigroups with idempotent-fixing automorphisms
نویسندگان
چکیده
منابع مشابه
Idempotent Measures on Compact Semigroups
Throughout this paper, 5 will be a compact Hausdorff topological semigroup, 5 will denote the convolution semigroup of normalized non-negative regular Borel measures on 5, and H will be the carrier of a measure p in 5. The space of continuous complex valued functions on 5 will be denoted by C(S), while Cr(S) will be the subspace of C(S) of real valued functions. Standard terminology and definit...
متن کاملOn supermatrix idempotent operator semigroups
One-parameter semigroups of antitriangle idempotent supermatrices and corresponding superoperator semigroups are introduced and investigated. It is shown that t-linear idempotent superoperators and exponential superoperators are mutually dual in some sense, and the first gives additional to exponential solution to the initial Cauchy problem. The corresponding functional equation and analog of r...
متن کاملComputing automorphisms of semigroups
In this paper an algorithm is presented that can be used to calculate the automorphism group of a finite transformation semigroup. The general algorithm employs a special method to compute the automorphism group of a finite simple semigroup. As an application of the algorithm, all the automorphism groups of semigroup of order at most 7 and of the multiplicative semigroups of some group rings ar...
متن کاملDestroying automorphisms by fixing nodes
The fixing number of a graph G is the minimum cardinality of a set S ⊂ V (G) such that every nonidentity automorphism of G moves at least one member of S, i.e., the automorphism group of the graph obtained from G by fixing every node in S is trivial. We provide a formula for the fixing number of a disconnected graph in terms of the fixing numbers of its components and make some observations abo...
متن کاملRewriting in Varieties of Idempotent Semigroups
We consider rewriting as a tool for solving identity problems in varieties of idempotent semigroups. It is known that there exist finite canonical term rewrite systems and finite canonical word rewrite systems for only a very limited number of those varieties. We present a finite canonical conditional word rewrite system for a particular variety in which the classical approaches cannot be appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2014
ISSN: 0037-1912,1432-2137
DOI: 10.1007/s00233-014-9585-0